Cost functions are nonconvex in the outputs when the technology is nonconvex: convexification is not harmless

نویسندگان

چکیده

This contribution focuses on testing the empirical impact of convexity assumption in estimating costs using nonparametric specifications technology and cost functions. Apart from reviewing scant available evidence, results based two publicly data sets reveal effect axiom function estimates: estimates convex technologies turn out to be average between 21% 38% lower than those computed nonconvex technologies. These differences are statistically significant when comparing kernel densities can illustrated sections along some output dimension. Finally, also characterization returns scale economies production functions for individual units yields conflicting 19% 31% observations. The theoretical known potential as well these should make us reconsider analysis: clearly, is not harmless.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

When Are Nonconvex Problems Not Scary?

In this note, we focus on smooth nonconvex optimization problems that obey: (1) all local minimizers are also global; and (2) around any saddle point or local maximizer, the objective has a negative directional curvature. Concrete applications such as dictionary learning, generalized phase retrieval, and orthogonal tensor decomposition are known to induce such structures. We describe a second-o...

متن کامل

Estimation of Returns to Scale in the Presence of Undesirable (bad) Outputs in DEA when the Firm is Regulated

The calculation of RTS amounts to measuring a relationship between inputs and outputs in a production structure. There are many methods to measure RTS in the primal space or the dual space. One of the main approaches is using the multiplier on the convexity constraint. But returns to scale measurements in DEA models are affected by the presence of regulatory constraints. These additional constr...

متن کامل

Nonconvex Optimization Is Combinatorial Optimization

Difficult nonconvex optimization problems contain a combinatorial number of local optima, making them extremely challenging for modern solvers. We present a novel nonconvex optimization algorithm that explicitly finds and exploits local structure in the objective function in order to decompose it into subproblems, exponentially reducing the size of the search space. Our algorithm’s use of decom...

متن کامل

Convexification Procedures and Decomposition Methods for Nonconvex Optimization Problems 1

In order for primal-dual methods to be applicable to a constrained minimization problem, it is necessary that restrictive convexity conditions are satisfied. In this paper, we consider a procedure by means of which a nonconvex problem is convexified and transformed into one which can be solved with the aid of primal-dual methods. Under this transformation, separability of the type necessary for...

متن کامل

When is the ring of real measurable functions a hereditary ring?

‎Let $M(X‎, ‎mathcal{A}‎, ‎mu)$ be the ring of real-valued measurable functions‎ ‎on a measure space $(X‎, ‎mathcal{A}‎, ‎mu)$‎. ‎In this paper‎, ‎we characterize the maximal ideals in the rings of real measurable functions‎ ‎and as a consequence‎, ‎we determine when $M(X‎, ‎mathcal{A}‎, ‎mu)$ is a hereditary ring.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Operations Research

سال: 2021

ISSN: ['1572-9338', '0254-5330']

DOI: https://doi.org/10.1007/s10479-021-04069-1